________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        03.02.2010 20:19:44
Input Data from:  dataset115.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :200
# of Locations  :10
Ex.Facilities   :2
Total budget    :20000
Terror. attacks :2

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,0635
Average f[i]   :4400
Average g[i,j] :1912,5
Total demand   :10200
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 9
> Selected Move:	890	1	-1	6	4500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0    >new incumb.: 890


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 29
> Selected Move:	1690	1	-1	8	10500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0    >new incumb.: 1690


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 31
> Selected Move:	2370	1	-1	2	15500


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  1  0    >new incumb.: 2370


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 30
> Selected Move:	2660	1	-1	7	20000


> New Y[]: 
	
	 2  3  1  0  0  0  1  1  1  0    >new incumb.: 2660


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 30
> Selected Move:	2450	3	7	4	20500


> New Y[]: 
	
	 2  3  1  0  1  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 14
> Selected Move:	2310	3	2	7	20000


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 25
> Selected Move:	2190	3	8	2	19000


> New Y[]: 
	
	 2  3  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 29
> Selected Move:	2320	3	4	5	20000


> New Y[]: 
	
	 2  3  1  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 32
> Selected Move:	2275	3	5	3	20500


> New Y[]: 
	
	 2  3  1  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 32
> Selected Move:	2230	2	7	-1	16000


> New Y[]: 
	
	 2  3  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 32
> Selected Move:	2350	3	2	8	17000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 28
> Selected Move:	2240	3	0	4	18800


> New Y[]: 
	
	 0  3  0  1  2  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 14
> Selected Move:	2260	3	3	2	17300


> New Y[]: 
	
	 0  3  1  0  2  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 18
> Selected Move:	2260	4	4	2	17500


> New Y[]: 
	
	 0  3  2  0  1  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 18
> Selected Move:	2260	4	2	6	17700


> New Y[]: 
	
	 0  3  1  0  1  0  2  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 17
> Selected Move:	2260	4	6	8	16300


> New Y[]: 
	
	 0  3  1  0  1  0  1  0  2  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 21
> Selected Move:	2240	3	2	3	17800


> New Y[]: 
	
	 0  3  0  1  1  0  1  0  2  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 20
> Selected Move:	2240	4	8	3	17400


> New Y[]: 
	
	 0  3  0  2  1  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 19
> Selected Move:	2240	4	3	6	19200


> New Y[]: 
	
	 0  3  0  1  1  0  2  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 20
> Selected Move:	2140	3	4	2	19200


> New Y[]: 
	
	 0  3  1  1  0  0  2  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 18
> Selected Move:	2140	4	6	2	19000


> New Y[]: 
	
	 0  3  2  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 14
> Selected Move:	2140	4	2	3	17400


> New Y[]: 
	
	 0  3  1  2  0  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 18
> Selected Move:	2140	4	3	8	17800


> New Y[]: 
	
	 0  3  1  1  0  0  1  0  2  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 20
> Selected Move:	2120	3	6	4	18300


> New Y[]: 
	
	 0  3  1  1  1  0  0  0  2  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 19
> Selected Move:	2120	4	8	2	19500


> New Y[]: 
	
	 0  3  2  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 16
> Selected Move:	2120	4	2	3	17900


> New Y[]: 
	
	 0  3  1  2  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 17
> Selected Move:	2120	4	3	4	19300


> New Y[]: 
	
	 0  3  1  1  2  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 19
> Selected Move:	2140	3	4	0	17500


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 30
> Selected Move:	2250	1	-1	6	22000


> New Y[]: 
	
	 2  3  1  1  0  0  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 13
> Selected Move:	2273	3	3	5	21500


> New Y[]: 
	
	 2  3  1  0  0  1  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 20
> Selected Move:	2190	3	8	4	20500


> New Y[]: 
	
	 2  3  1  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 20
> Selected Move:	2185	3	5	3	21000


> New Y[]: 
	
	 2  3  1  1  1  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,37

## ITERATION 32 #######################


> Neighbours evaluated; 20
> Selected Move:	2120	4	0	2	18000


> New Y[]: 
	
	 0  3  2  1  1  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,365

## ITERATION 33 #######################


> Neighbours evaluated; 18
> Selected Move:	2120	4	2	3	16400


> New Y[]: 
	
	 0  3  1  2  1  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,36

## ITERATION 34 #######################


> Neighbours evaluated; 20
> Selected Move:	2120	4	3	4	17800


> New Y[]: 
	
	 0  3  1  1  2  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,355

## ITERATION 35 #######################


> Neighbours evaluated; 16
> Selected Move:	2120	4	4	6	18200


> New Y[]: 
	
	 0  3  1  1  1  0  2  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,35

## ITERATION 36 #######################


> Neighbours evaluated; 20
> Selected Move:	1940	3	3	5	17700


> New Y[]: 
	
	 0  3  1  0  1  1  2  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,345

## ITERATION 37 #######################


> Neighbours evaluated; 24
> Selected Move:	2060	3	2	8	18700


> New Y[]: 
	
	 0  3  0  0  1  1  2  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,34

## ITERATION 38 #######################


> Neighbours evaluated; 18
> Selected Move:	2060	4	6	4	18300


> New Y[]: 
	
	 0  3  0  0  2  1  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,335

## ITERATION 39 #######################


> Neighbours evaluated; 14
> Selected Move:	2170	3	4	0	16500


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 40 #######################


> Neighbours evaluated; 30
> Selected Move:	2120	3	5	9	17000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 41 #######################


> Neighbours evaluated; 34
> Selected Move:	2150	1	-1	2	22000


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 42 #######################


> Neighbours evaluated; 25
> Selected Move:	2010	3	8	4	21000


> New Y[]: 
	
	 2  3  1  0  1  0  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,315

## ITERATION 43 #######################


> Neighbours evaluated; 30
> Selected Move:	2000	2	4	-1	16000


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 44 #######################


> Neighbours evaluated; 31
> Selected Move:	2050	3	9	5	15500


> New Y[]: 
	
	 2  3  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 45 #######################


> Neighbours evaluated; 29
> Selected Move:	2100	1	-1	3	22000


> New Y[]: 
	
	 2  3  1  1  0  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 46 #######################


> Neighbours evaluated; 22
> Selected Move:	2030	2	2	-1	17000


> New Y[]: 
	
	 2  3  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 47 #######################


> Neighbours evaluated; 31
> Selected Move:	1980	3	5	9	17500


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 48 #######################


> Neighbours evaluated; 31
> Selected Move:	1935	1	-1	2	22500


> New Y[]: 
	
	 2  3  1  1  0  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 49 #######################


> Neighbours evaluated; 26
> Selected Move:	1918	3	3	7	20500


> New Y[]: 
	
	 2  3  1  0  0  0  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 50 #######################


> Neighbours evaluated; 33
> Selected Move:	1860	2	9	-1	14000


> New Y[]: 
	
	 2  3  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 51 #######################


> Neighbours evaluated; 28
> Selected Move:	1980	3	2	8	15000


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 52 #######################


> Neighbours evaluated; 30
> Selected Move:	2205	1	-1	3	21500


> New Y[]: 
	
	 2  3  0  1  0  0  1  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 53 #######################


> Neighbours evaluated; 30
> Selected Move:	2155	3	3	5	21000


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 54 #######################


> Neighbours evaluated; 31
> Selected Move:	2065	3	7	4	21500


> New Y[]: 
	
	 2  3  0  0  1  1  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,295

## ITERATION 55 #######################


> Neighbours evaluated; 14
> Selected Move:	2090	3	5	3	22000


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,3

## ITERATION 56 #######################


> Neighbours evaluated; 15
> Selected Move:	2020	3	8	7	20500


> New Y[]: 
	
	 2  3  0  1  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,305

## ITERATION 57 #######################


> Neighbours evaluated; 30
> Selected Move:	1970	3	3	5	20000


> New Y[]: 
	
	 2  3  0  0  1  1  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,31

## ITERATION 58 #######################


> Neighbours evaluated; 30
> Selected Move:	1835	3	4	3	21500


> New Y[]: 
	
	 2  3  0  1  0  1  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 59 #######################


> Neighbours evaluated; 28
> Selected Move:	1885	3	7	8	23000


> New Y[]: 
	
	 2  3  0  1  0  1  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 60 #######################


> Neighbours evaluated; 15
> Selected Move:	1940	4	0	3	18400


> New Y[]: 
	
	 0  3  0  2  0  1  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,325

## ITERATION 61 #######################


> Neighbours evaluated; 19
> Selected Move:	1960	3	3	2	18500


> New Y[]: 
	
	 0  3  2  0  0  1  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,33

## ITERATION 62 #######################


> Neighbours evaluated; 18
> Selected Move:	1960	4	2	5	17200


> New Y[]: 
	
	 0  3  1  0  0  2  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,335

## ITERATION 63 #######################


> Neighbours evaluated; 22
> Selected Move:	2060	3	2	4	17200


> New Y[]: 
	
	 0  3  0  0  1  2  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,34

## ITERATION 64 #######################


> Neighbours evaluated; 20
> Selected Move:	2060	4	5	8	17300


> New Y[]: 
	
	 0  3  0  0  1  1  1  0  2  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,335

## ITERATION 65 #######################


> Neighbours evaluated; 22
> Selected Move:	2010	3	5	9	17800


> New Y[]: 
	
	 0  3  0  0  1  0  1  0  2  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,33

## ITERATION 66 #######################


> Neighbours evaluated; 25
> Selected Move:	2010	4	8	4	18800


> New Y[]: 
	
	 0  3  0  0  2  0  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,325

## ITERATION 67 #######################


> Neighbours evaluated; 22
> Selected Move:	2010	4	4	6	19200


> New Y[]: 
	
	 0  3  0  0  1  0  2  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,32

## ITERATION 68 #######################


> Neighbours evaluated; 20
> Selected Move:	2010	4	6	9	17400


> New Y[]: 
	
	 0  3  0  0  1  0  1  0  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,315

## ITERATION 69 #######################


> Neighbours evaluated; 24
> Selected Move:	2020	3	9	0	15500


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,31

## ITERATION 70 #######################


> Neighbours evaluated; 21
> Selected Move:	1900	3	1	2	17300


> New Y[]: 
	
	 2  0  3  0  1  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,305

## ITERATION 71 #######################


> Neighbours evaluated; 13
> Selected Move:	2140	3	4	3	18800


> New Y[]: 
	
	 2  0  3  1  0  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,3

## ITERATION 72 #######################


> Neighbours evaluated; 19
> Selected Move:	2140	4	2	3	17200


> New Y[]: 
	
	 2  0  1  3  0  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,295

## ITERATION 73 #######################


> Neighbours evaluated; 22
> Selected Move:	2140	4	3	6	19500


> New Y[]: 
	
	 2  0  1  1  0  0  3  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,29

## ITERATION 74 #######################


> Neighbours evaluated; 16
> Selected Move:	2140	4	6	8	18500


> New Y[]: 
	
	 2  0  1  1  0  0  1  0  3  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,285

## ITERATION 75 #######################


> Neighbours evaluated; 20
> Selected Move:	2035	3	0	4	20300


> New Y[]: 
	
	 0  0  1  1  2  0  1  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,28

## ITERATION 76 #######################


> Neighbours evaluated; 6
> Selected Move:	2120	4	4	3	18900


> New Y[]: 
	
	 0  0  1  2  1  0  1  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,275

## ITERATION 77 #######################


> Neighbours evaluated; 8
> Selected Move:	2120	4	3	8	18000


> New Y[]: 
	
	 0  0  1  3  1  0  1  0  2  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,27

## ITERATION 78 #######################


> Neighbours evaluated; 10
> Selected Move:	2120	4	3	2	19600


> New Y[]: 
	
	 0  0  3  1  1  0  1  0  2  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,265

## ITERATION 79 #######################


> Neighbours evaluated; 9
> Selected Move:	2120	4	8	3	19200


> New Y[]: 
	
	 0  0  3  2  1  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,26

## ITERATION 80 #######################


> Neighbours evaluated; 7
> Selected Move:	2120	4	2	3	19200


> New Y[]: 
	
	 0  0  2  3  1  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,255

## ITERATION 81 #######################


> Neighbours evaluated; 7
> Selected Move:	2120	4	2	4	19000


> New Y[]: 
	
	 0  0  1  3  2  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,25

## ITERATION 82 #######################


> Neighbours evaluated; 10
> Selected Move:	2120	4	3	4	19800


> New Y[]: 
	
	 0  0  1  2  3  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,245

## ITERATION 83 #######################


> Neighbours evaluated; 9
> Selected Move:	2120	4	4	6	19900


> New Y[]: 
	
	 0  0  1  2  1  0  3  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,24

## ITERATION 84 #######################


> Neighbours evaluated; 8
> Selected Move:	2120	4	3	6	19400


> New Y[]: 
	
	 0  0  1  3  1  0  2  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,235

## ITERATION 85 #######################


> Neighbours evaluated; 17
> Selected Move:	1956	4	3	8	20700


> New Y[]: 
	
	 0  0  1  1  1  0  2  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,23

## ITERATION 86 #######################


> Neighbours evaluated; 10
> Selected Move:	2051	4	6	8	20300


> New Y[]: 
	
	 0  0  1  1  1  0  3  0  2  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,225

## ITERATION 87 #######################


> Neighbours evaluated; 9
> Selected Move:	2075	4	6	4	20200


> New Y[]: 
	
	 0  0  1  1  3  0  1  0  2  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,22

## ITERATION 88 #######################


> Neighbours evaluated; 15
> Selected Move:	1940	3	3	5	19700


> New Y[]: 
	
	 0  0  1  0  3  1  1  0  2  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,215

## ITERATION 89 #######################


> Neighbours evaluated; 9
> Selected Move:	1960	3	4	1	17300


> New Y[]: 
	
	 0  3  1  0  0  1  1  0  2  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,21

## ITERATION 90 #######################


> Neighbours evaluated; 20
> Selected Move:	2257	1	-1	4	22300


> New Y[]: 
	
	 0  3  1  0  1  1  1  0  2  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,205

## ITERATION 91 #######################


> Neighbours evaluated; 11
> Selected Move:	2386	3	5	7	20800


> New Y[]: 
	
	 0  3  1  0  1  0  1  1  2  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,21

## ITERATION 92 #######################


> Neighbours evaluated; 28
> Selected Move:	2332	3	7	3	22800


> New Y[]: 
	
	 0  3  1  1  1  0  1  0  2  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,215

## ITERATION 93 #######################


> Neighbours evaluated; 9
> Selected Move:	2404	4	8	3	22400


> New Y[]: 
	
	 0  3  1  2  1  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,22

## ITERATION 94 #######################


> Neighbours evaluated; 17
> Selected Move:	2256	3	3	5	22200


> New Y[]: 
	
	 0  3  1  0  1  2  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,225

## ITERATION 95 #######################


> Neighbours evaluated; 18
> Selected Move:	2150	3	5	9	22400


> New Y[]: 
	
	 0  3  1  0  1  0  1  0  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,23

## ITERATION 96 #######################


> Neighbours evaluated; 24
> Selected Move:	2046	4	9	8	22800


> New Y[]: 
	
	 0  3  1  0  1  0  1  0  2  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,235

## ITERATION 97 #######################


> Neighbours evaluated; 22
> Selected Move:	1910	2	4	-1	17800


> New Y[]: 
	
	 0  3  1  0  0  0  1  0  2  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,24

## ITERATION 98 #######################


> Neighbours evaluated; 24
> Selected Move:	1910	4	8	2	19000


> New Y[]: 
	
	 0  3  2  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,245

## ITERATION 99 #######################


> Neighbours evaluated; 21
> Selected Move:	1910	4	2	6	19200


> New Y[]: 
	
	 0  3  1  0  0  0  2  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,25

## ITERATION 100 #######################


> Neighbours evaluated; 21
> Selected Move:	1960	3	9	5	18700


> New Y[]: 
	
	 0  3  1  0  0  1  2  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,255

## ITERATION 101 #######################


> Neighbours evaluated; 18
> Selected Move:	1960	3	6	0	17000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 102 #######################


> Neighbours evaluated; 30
> Selected Move:	1960	3	1	6	19000


> New Y[]: 
	
	 2  0  1  0  0  1  3  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,255

## ITERATION 103 #######################


> Neighbours evaluated; 17
> Selected Move:	1960	4	6	2	18300


> New Y[]: 
	
	 2  0  3  0  0  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,25

## ITERATION 104 #######################


> Neighbours evaluated; 18
> Selected Move:	1960	4	2	5	17100


> New Y[]: 
	
	 2  0  1  0  0  3  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,245

## ITERATION 105 #######################


> Neighbours evaluated; 18
> Selected Move:	1960	4	5	8	18000


> New Y[]: 
	
	 2  0  1  0  0  1  1  0  3  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,24

## ITERATION 106 #######################


> Neighbours evaluated; 19
> Selected Move:	1940	3	0	4	19800


> New Y[]: 
	
	 0  0  1  0  2  1  1  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,235

## ITERATION 107 #######################


> Neighbours evaluated; 9
> Selected Move:	1940	4	4	2	20000


> New Y[]: 
	
	 0  0  2  0  1  1  1  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,23

## ITERATION 108 #######################


> Neighbours evaluated; 10
> Selected Move:	2005	3	5	3	20500


> New Y[]: 
	
	 0  0  2  1  1  0  1  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,225

## ITERATION 109 #######################


> Neighbours evaluated; 13
> Selected Move:	1880	3	2	0	18500


> New Y[]: 
	
	 2  0  0  1  1  0  1  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,22

## ITERATION 110 #######################


> Neighbours evaluated; 15
> Selected Move:	1940	3	4	5	19500


> New Y[]: 
	
	 2  0  0  1  0  1  1  0  3  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,215

## ITERATION 111 #######################


> Neighbours evaluated; 15
> Selected Move:	1940	4	8	3	18200


> New Y[]: 
	
	 2  0  0  3  0  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,21

## ITERATION 112 #######################


> Neighbours evaluated; 19
> Selected Move:	1948	1	-1	2	23200


> New Y[]: 
	
	 2  0  1  3  0  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,205

## ITERATION 113 #######################


> Neighbours evaluated; 18
> Selected Move:	2109	3	5	4	22200


> New Y[]: 
	
	 2  0  1  3  1  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,2

## ITERATION 114 #######################


> Neighbours evaluated; 18
> Selected Move:	2090	3	4	7	21700


> New Y[]: 
	
	 2  0  1  3  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,195

## ITERATION 115 #######################


> Neighbours evaluated; 29
> Selected Move:	2034	3	8	4	20700


> New Y[]: 
	
	 2  0  1  3  1  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0 
 > pw :0,2

## ITERATION 116 #######################


> Neighbours evaluated; 30
> Selected Move:	1920	3	7	5	22200


> New Y[]: 
	
	 2  0  1  3  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0 
 > pw :0,205

## ITERATION 117 #######################


> Neighbours evaluated; 16
> Selected Move:	1880	2	5	-1	16200


> New Y[]: 
	
	 2  0  1  3  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0 
 > pw :0,21

## ITERATION 118 #######################


> Neighbours evaluated; 17
> Selected Move:	1900	3	3	1	14500


> New Y[]: 
	
	 2  3  1  0  1  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,215

## ITERATION 119 #######################


> Neighbours evaluated; 19
> Selected Move:	1940	3	0	5	16200


> New Y[]: 
	
	 0  3  1  0  1  2  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,22

## ITERATION 120 #######################


> Neighbours evaluated; 22
> Selected Move:	2056	1	-1	7	20700


> New Y[]: 
	
	 0  3  1  0  1  2  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,225

## ITERATION 121 #######################


> Neighbours evaluated; 27
> Selected Move:	2208	3	5	3	20900


> New Y[]: 
	
	 0  3  1  2  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,23

## ITERATION 122 #######################


> Neighbours evaluated; 29
> Selected Move:	2093	3	2	8	21900


> New Y[]: 
	
	 0  3  0  2  1  0  1  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,235

## ITERATION 123 #######################


> Neighbours evaluated; 23
> Selected Move:	2080	3	3	2	22000


> New Y[]: 
	
	 0  3  2  0  1  0  1  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,24

## ITERATION 124 #######################


> Neighbours evaluated; 20
> Selected Move:	2118	4	2	4	21800


> New Y[]: 
	
	 0  3  1  0  2  0  1  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,245

## ITERATION 125 #######################


> Neighbours evaluated; 25
> Selected Move:	2011	4	4	6	22200


> New Y[]: 
	
	 0  3  1  0  1  0  2  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,25

## ITERATION 126 #######################


> Neighbours evaluated; 22
> Selected Move:	2065	3	6	0	20500


> New Y[]: 
	
	 2  3  1  0  1  0  0  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,255

## ITERATION 127 #######################


> Neighbours evaluated; 32
> Selected Move:	1923	3	7	3	22500


> New Y[]: 
	
	 2  3  1  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,26

## ITERATION 128 #######################


> Neighbours evaluated; 20
> Selected Move:	1910	3	4	7	22000


> New Y[]: 
	
	 2  3  1  1  0  0  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 129 #######################


> Neighbours evaluated; 28
> Selected Move:	1905	3	8	4	21000


> New Y[]: 
	
	 2  3  1  1  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 130 #######################


> Neighbours evaluated; 30
> Selected Move:	1880	2	7	-1	16500


> New Y[]: 
	
	 2  3  1  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 131 #######################


> Neighbours evaluated; 32
> Selected Move:	1900	3	3	8	16000


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,28

## ITERATION 132 #######################


> Neighbours evaluated; 22
> Selected Move:	1940	3	0	5	17700


> New Y[]: 
	
	 0  3  1  0  1  2  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,285

## ITERATION 133 #######################


> Neighbours evaluated; 20
> Selected Move:	1940	4	5	2	19000


> New Y[]: 
	
	 0  3  2  0  1  1  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,29

## ITERATION 134 #######################


> Neighbours evaluated; 18
> Selected Move:	1940	4	2	4	18800


> New Y[]: 
	
	 0  3  1  0  2  1  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,295

## ITERATION 135 #######################


> Neighbours evaluated; 18
> Selected Move:	1940	4	4	8	17800


> New Y[]: 
	
	 0  3  1  0  1  1  0  0  2  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,29

## ITERATION 136 #######################


> Neighbours evaluated; 19
> Selected Move:	1940	3	1	6	19800


> New Y[]: 
	
	 0  0  1  0  1  1  3  0  2  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,285

## ITERATION 137 #######################


> Neighbours evaluated; 8
> Selected Move:	1940	4	6	2	19100


> New Y[]: 
	
	 0  0  3  0  1  1  1  0  2  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,28

## ITERATION 138 #######################


> Neighbours evaluated; 8
> Selected Move:	1940	4	2	5	17900


> New Y[]: 
	
	 0  0  1  0  1  3  1  0  2  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,275

## ITERATION 139 #######################


> Neighbours evaluated; 11
> Selected Move:	1940	4	5	8	18700


> New Y[]: 
	
	 0  0  1  0  1  2  1  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,27

## ITERATION 140 #######################


> Neighbours evaluated; 11
> Selected Move:	1940	4	8	2	19000


> New Y[]: 
	
	 0  0  3  0  1  2  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,265

## ITERATION 141 #######################


> Neighbours evaluated; 8
> Selected Move:	1940	4	2	4	19600


> New Y[]: 
	
	 0  0  1  0  3  2  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,26

## ITERATION 142 #######################


> Neighbours evaluated; 8
> Selected Move:	1940	4	4	5	18900


> New Y[]: 
	
	 0  0  1  0  2  3  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,255

## ITERATION 143 #######################


> Neighbours evaluated; 10
> Selected Move:	1940	4	4	2	19100


> New Y[]: 
	
	 0  0  2  0  1  3  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,25

## ITERATION 144 #######################


> Neighbours evaluated; 8
> Selected Move:	1940	4	2	6	19300


> New Y[]: 
	
	 0  0  1  0  1  3  2  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,245

## ITERATION 145 #######################


> Neighbours evaluated; 10
> Selected Move:	1940	4	5	6	19700


> New Y[]: 
	
	 0  0  1  0  1  2  3  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,24

## ITERATION 146 #######################


> Neighbours evaluated; 15
> Selected Move:	1900	3	5	0	18000


> New Y[]: 
	
	 2  0  1  0  1  0  3  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,235

## ITERATION 147 #######################


> Neighbours evaluated; 12
> Selected Move:	1910	3	4	9	19500


> New Y[]: 
	
	 2  0  1  0  0  0  3  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,23

## ITERATION 148 #######################


> Neighbours evaluated; 21
> Selected Move:	1910	4	6	2	18800


> New Y[]: 
	
	 2  0  3  0  0  0  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,225

## ITERATION 149 #######################


> Neighbours evaluated; 24
> Selected Move:	1910	4	2	8	18500


> New Y[]: 
	
	 2  0  1  0  0  0  1  0  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,22

## ITERATION 150 #######################


> Neighbours evaluated; 23
> Selected Move:	1910	4	8	9	17700


> New Y[]: 
	
	 2  0  1  0  0  0  1  0  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,215

## ITERATION 151 #######################


> Neighbours evaluated; 25
> Selected Move:	1900	3	9	4	17900


> New Y[]: 
	
	 2  0  1  0  3  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,21

## ITERATION 152 #######################


> Neighbours evaluated; 11
> Selected Move:	1900	4	4	8	17000


> New Y[]: 
	
	 2  0  1  0  1  0  1  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,205

## ITERATION 153 #######################


> Neighbours evaluated; 16
> Selected Move:	1890	3	0	9	18900


> New Y[]: 
	
	 0  0  1  0  1  0  1  0  3  2 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,2

## ITERATION 154 #######################


> Neighbours evaluated; 22
> Selected Move:	1890	4	8	2	19200


> New Y[]: 
	
	 0  0  3  0  1  0  1  0  1  2 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,195

## ITERATION 155 #######################


> Neighbours evaluated; 19
> Selected Move:	1890	4	2	4	19800


> New Y[]: 
	
	 0  0  1  0  3  0  1  0  1  2 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,19

## ITERATION 156 #######################


> Neighbours evaluated; 17
> Selected Move:	1910	3	4	1	17400


> New Y[]: 
	
	 0  3  1  0  0  0  1  0  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,185

## ITERATION 157 #######################


> Neighbours evaluated; 21
> Selected Move:	1890	3	2	3	18900


> New Y[]: 
	
	 0  3  0  1  0  0  1  0  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,18

## ITERATION 158 #######################


> Neighbours evaluated; 25
> Selected Move:	1968	1	-1	4	23900


> New Y[]: 
	
	 0  3  0  1  1  0  1  0  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,175

## ITERATION 159 #######################


> Neighbours evaluated; 24
> Selected Move:	2220	3	9	2	24000


> New Y[]: 
	
	 0  3  2  1  1  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,17

## ITERATION 160 #######################


> Neighbours evaluated; 11
> Selected Move:	2274	4	2	4	23800


> New Y[]: 
	
	 0  3  1  1  2  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,165

## ITERATION 161 #######################


> Neighbours evaluated; 14
> Selected Move:	2227	4	4	6	24200


> New Y[]: 
	
	 0  3  1  1  1  0  2  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,16

## ITERATION 162 #######################


> Neighbours evaluated; 19
> Selected Move:	2148	3	3	5	23700


> New Y[]: 
	
	 0  3  1  0  1  1  2  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,165

## ITERATION 163 #######################


> Neighbours evaluated; 15
> Selected Move:	2196	4	6	4	23300


> New Y[]: 
	
	 0  3  1  0  2  1  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,17

## ITERATION 164 #######################


> Neighbours evaluated; 15
> Selected Move:	2145	4	4	2	23500


> New Y[]: 
	
	 0  3  2  0  1  1  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,175

## ITERATION 165 #######################


> Neighbours evaluated; 15
> Selected Move:	2125	3	2	3	23400


> New Y[]: 
	
	 0  3  0  2  1  1  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,18

## ITERATION 166 #######################


> Neighbours evaluated; 19
> Selected Move:	2168	3	8	2	22400


> New Y[]: 
	
	 0  3  1  2  1  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,185

## ITERATION 167 #######################


> Neighbours evaluated; 22
> Selected Move:	2101	4	3	5	22700


> New Y[]: 
	
	 0  3  1  1  1  2  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,19

## ITERATION 168 #######################


> Neighbours evaluated; 23
> Selected Move:	2017	3	2	8	23700


> New Y[]: 
	
	 0  3  0  1  1  2  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,195

## ITERATION 169 #######################


> Neighbours evaluated; 16
> Selected Move:	1999	3	3	7	21700


> New Y[]: 
	
	 0  3  0  0  1  2  1  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,2

## ITERATION 170 #######################


> Neighbours evaluated; 24
> Selected Move:	1970	4	5	8	21800


> New Y[]: 
	
	 0  3  0  0  1  1  1  1  2  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,205

## ITERATION 171 #######################


> Neighbours evaluated; 24
> Selected Move:	2059	3	5	3	22300


> New Y[]: 
	
	 0  3  0  1  1  0  1  1  2  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,21

## ITERATION 172 #######################


> Neighbours evaluated; 26
> Selected Move:	1947	3	4	2	22300


> New Y[]: 
	
	 0  3  1  1  0  0  1  1  2  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,215

## ITERATION 173 #######################


> Neighbours evaluated; 21
> Selected Move:	2022	4	8	3	21900


> New Y[]: 
	
	 0  3  1  2  0  0  1  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,22

## ITERATION 174 #######################


> Neighbours evaluated; 25
> Selected Move:	1882	3	6	4	22400


> New Y[]: 
	
	 0  3  1  2  1  0  0  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,225

## ITERATION 175 #######################


> Neighbours evaluated; 22
> Selected Move:	1780	4	3	8	22800


> New Y[]: 
	
	 0  3  1  1  1  0  0  1  2  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,23

## ITERATION 176 #######################


> Neighbours evaluated; 23
> Selected Move:	1789	3	8	6	22700


> New Y[]: 
	
	 0  3  1  1  1  0  2  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,235

## ITERATION 177 #######################


> Neighbours evaluated; 23
> Selected Move:	1870	4	6	4	22300


> New Y[]: 
	
	 0  3  1  1  2  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,24

## ITERATION 178 #######################


> Neighbours evaluated; 25
> Selected Move:	1810	4	4	2	22500


> New Y[]: 
	
	 0  3  2  1  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,245

## ITERATION 179 #######################


> Neighbours evaluated; 24
> Selected Move:	1750	2	3	-1	16000


> New Y[]: 
	
	 0  3  2  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,25

## ITERATION 180 #######################


> Neighbours evaluated; 28
> Selected Move:	1940	3	7	5	17500


> New Y[]: 
	
	 0  3  2  0  1  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,255

## ITERATION 181 #######################


> Neighbours evaluated; 19
> Selected Move:	1940	4	2	4	17300


> New Y[]: 
	
	 0  3  1  0  2  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,26

## ITERATION 182 #######################


> Neighbours evaluated; 20
> Selected Move:	1920	3	2	3	18800


> New Y[]: 
	
	 0  3  0  1  2  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,265

## ITERATION 183 #######################


> Neighbours evaluated; 22
> Selected Move:	1940	3	4	8	18800


> New Y[]: 
	
	 0  3  0  1  0  1  1  0  2  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,27

## ITERATION 184 #######################


> Neighbours evaluated; 15
> Selected Move:	1940	4	8	5	18700


> New Y[]: 
	
	 0  3  0  1  0  2  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,265

## ITERATION 185 #######################


> Neighbours evaluated; 15
> Selected Move:	1920	3	6	4	19200


> New Y[]: 
	
	 0  3  0  1  1  2  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,26

## ITERATION 186 #######################


> Neighbours evaluated; 19
> Selected Move:	1920	4	5	3	18900


> New Y[]: 
	
	 0  3  0  2  1  1  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,255

## ITERATION 187 #######################


> Neighbours evaluated; 21
> Selected Move:	1920	4	3	8	19300


> New Y[]: 
	
	 0  3  0  1  1  1  0  0  2  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,25

## ITERATION 188 #######################


> Neighbours evaluated; 18
> Selected Move:	1920	3	8	6	19200


> New Y[]: 
	
	 0  3  0  1  1  1  2  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,245

## ITERATION 189 #######################


> Neighbours evaluated; 19
> Selected Move:	1920	4	6	3	17400


> New Y[]: 
	
	 0  3  0  2  1  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,24

## ITERATION 190 #######################


> Neighbours evaluated; 18
> Selected Move:	1920	4	3	5	17700


> New Y[]: 
	
	 0  3  0  1  1  2  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,235

## ITERATION 191 #######################


> Neighbours evaluated; 20
> Selected Move:	1880	3	5	0	16000


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,23

## ITERATION 192 #######################


> Neighbours evaluated; 23
> Selected Move:	1900	1	-1	5	22000


> New Y[]: 
	
	 2  3  0  1  1  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,225

## ITERATION 193 #######################


> Neighbours evaluated; 19
> Selected Move:	1865	3	0	8	23800


> New Y[]: 
	
	 0  3  0  1  1  1  1  0  2  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,22

## ITERATION 194 #######################


> Neighbours evaluated; 10
> Selected Move:	1920	4	1	3	19000


> New Y[]: 
	
	 0  0  0  3  1  1  1  0  2  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,215

## ITERATION 195 #######################


> Neighbours evaluated; 12
> Selected Move:	1920	4	3	5	19400


> New Y[]: 
	
	 0  0  0  1  1  3  1  0  2  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,21

## ITERATION 196 #######################


> Neighbours evaluated; 12
> Selected Move:	1920	4	8	3	19000


> New Y[]: 
	
	 0  0  0  2  1  3  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,205

## ITERATION 197 #######################


> Neighbours evaluated; 12
> Selected Move:	1920	4	3	5	18900


> New Y[]: 
	
	 0  0  0  3  1  2  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,2

## ITERATION 198 #######################


> Neighbours evaluated; 13
> Selected Move:	1920	4	5	4	20000


> New Y[]: 
	
	 0  0  0  3  2  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,195

## ITERATION 199 #######################


> Neighbours evaluated; 13
> Selected Move:	1921	3	3	2	20100


> New Y[]: 
	
	 0  0  3  0  2  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,19

## ITERATION 200 #######################


> Neighbours evaluated; 11
> Selected Move:	2006	3	5	3	20600


> New Y[]: 
	
	 0  0  3  1  2  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,185

## ITERATION 201 #######################


> Neighbours evaluated; 14
> Selected Move:	1935	4	4	6	21000


> New Y[]: 
	
	 0  0  3  1  1  0  2  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,19

## ITERATION 202 #######################


> Neighbours evaluated; 15
> Selected Move:	1880	3	6	0	19300


> New Y[]: 
	
	 2  0  3  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0 
 > pw :0,185

## ITERATION 203 #######################


> Neighbours evaluated; 18
> Selected Move:	1880	4	2	3	17700


> New Y[]: 
	
	 2  0  1  3  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0 
 > pw :0,18
________________________________________________________________

Best solution found: 2660
Run Termination time: 03.02.2010 20:20:13
Run duration: 00:00:29.5156250
________________________________________________________________
